Multiplicatively idempotent semirings

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Non-termination in Idempotent Semirings

We study and compare two notions of non-termination on idempotent semirings: infinite iteration and divergence. We determine them in various models and develop conditions for their coincidence. It turns out that divergence yields a simple and natural way of modelling infinite behaviour, whereas infinite iteration shows some anomalies.

متن کامل

On idempotent matrices over semirings

Idempotent matrices play a significant role while dealing with different questions in matrix theory and its applications. It is easy to see that over a field any idempotent matrix is similar to a diagonal matrix with 0 and 1 on the main diagonal. Over a semiring the situation is quite different. For example, the matrix J of all ones is idempotent over Boolean semiring. The first characterizatio...

متن کامل

Idempotent Subreducts of Semimodules over Commutative Semirings

A short proof of the characterization of idempotent subreducts of semimodules over commutative semirings is presented. It says that an idempotent algebra embeds into a semimodule over a commutative semiring, if and only if it belongs to the variety of Szendrei modes.

متن کامل

Categories of Algebraic Contexts Equivalent to Idempotent Semirings and Domain Semirings

A categorical equivalence between algebraic contexts with relational morphisms and join-semilattices with homomorphisms is presented and extended to idempotent semirings and domain semirings. These contexts are the Kripke structures for idempotent semirings and allow more efficient computations on finite models because they can be logarithmically smaller than the original semiring. Some example...

متن کامل

Further Galois Connections between Semimodules over Idempotent Semirings

In [14] a generalisation of Formal Concept Analysis was introduced with data mining applications in mind, K-Formal Concept Analysis, where incidences take values in certain kinds of semirings, instead of the standard Boolean carrier set. The construction leading to the pair of dually (order) isomorphic lattices can be further manipulated to obtain the three other types of Galois Connections pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematica Bohemica

سال: 2015

ISSN: 0862-7959,2464-7136

DOI: 10.21136/mb.2015.144177